#include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
int rint(char f){
  char ch=getchar();
  int sgn=1;
  int v=0;
  if(ch=='-')sgn=-1;
  else{
    assert('0'<=ch && ch<='9');
    v=ch-'0';
  }
  while(true){
    char ch=getchar();
    if(ch==f)break;
    assert('0'<=ch && ch<='9');
    v=v*10+ch-'0';
  }
  return v*sgn;
}
const int mx=1e5+10;
const uli mod=1e9+7;
int a[mx];
struct iv{
  int l,r;
  bool operator <(iv x)const{ return r<x.l; }
};
bool eq(iv a,iv b){  return !(a<b) && !(b<a); }
set<iv>s[2];
int dx[mx];
void add(set<iv>&s,iv x){
  if(x.l==x.r)return;
  auto it=s.lower_bound(x); 
  int from=x.l,to=x.r;
  while(it!=s.end() && eq(*it,x)){
    from=min(from,it->l);
    to=max(to,it->r);
    it=s.erase(it);
  }
  s.insert({from,to});
}
uli solve(){
  int n=rint(' ');
  assert(1<=n && n<=1e5);
  int m=rint(' ');
  assert(1<=m && m<=1e5);
  int k=rint('\n');
  assert(1<=k && k<=1e9);
  for(int i=0;i<n;i++){
    a[i]=rint((i==n-1)?'\n':' ');    
//    assert(a[i]==-1 || (1<=a[i] && a[i]<=k) );
    dx[i]=0;
  }
  //merge intervals
  for(int it=0;it<2;it++)s[it].clear();  
  for(int i=0;i<m;i++){
    char op=getchar();
    assert(getchar()==' ');
    assert(op=='I' || op=='D');
    int l=rint(' ');
    int r=rint('\n');
    assert(1<=l && l<=n && l<r);
    --l,--r;
    if(op=='I')add(s[0],{l,r});
    else add(s[1],{l,r});
  }
  //a[i]+dx[i]=a[i+1]
  for(int it=0;it<2;it++){  
    for(auto p:s[it]){
      for(int i=p.l;i<p.r;i++){
        if(dx[i]!=0)return 0;
        dx[i]=(it==0?+1:-1);
      }
    }
  }

//  cerr<<"dx=";for(int i=0;i<n;i++)cerr<<dx[i]<<" ";cerr<<endl;
  uli ans=1;
  for(int i=0;i<n;){
    if(dx[i]==0){
//    if(i-1>=0 && dx[i-1]==0 )ans=ans*uli(k)%mod;
      if(i==0 || dx[i-1]==0 )if(a[i]==-1)ans=ans*uli(k)%mod;
      i++;
      continue;
    }
    int l=i;
    int idx=-1;
    int sm=0;
    int mini=0,maxi=0;
    while(i<n && dx[i]!=0){
      if(a[i]!=-1)idx=i;
      sm+=dx[i++];
      mini=min(mini,sm);
      maxi=max(maxi,sm);
    }
    if(a[i]!=-1)idx=i;
    int r=i-1;
    if(idx==-1){
      int from=1-mini;
      int to=k-maxi;
      if(from>to)return 0;
      ans=ans*uli(to-from+1)%mod;
    }
    else{
      int sm=0;
      for(int j=l;j<idx;j++)sm+=dx[j];
      int v=a[idx]-sm;
      if(v<=0 || v>k)return 0;
      for(int j=l;j<=r+1;j++){
        if(a[j]!=-1 && a[j]!=v)return 0;
        v+=dx[j];
        if(v<=0 || v>k)return 0;
      }      
    }
  }
  return ans;
}

int main(){
  int t=rint('\n');
  assert(1<=t && t<=20);
  while(t--){
    uli ans=solve();
    printf("%lld\n",ans);
  }
  assert(getchar()==EOF);
  return 0;
}